On Moore-Penrose Pseudoinverse Computation for Stiffness Matrices Resulting from Higher Order Approximation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Computation of Moore-Penrose Inverse Matrices

Many neural learning algorithms require to solve large least square systems in order to obtain synaptic weights. Moore-Penrose inverse matrices allow for solving such systems, even with rank deficiency, and they provide minimum-norm vectors of synaptic weights, which contribute to the regularization of the input-output mapping. It is thus of interest to develop fast and accurate algorithms for ...

متن کامل

Beyond Moore-Penrose Part II: The Sparse Pseudoinverse

This is the second part of a two-paper series on norm-minimizing generalized inverses. In Part II we focus on generalized inverses that are minimizers of entrywise ` norms, with the main representative being the sparse pseudoinverse for p = 1. We are motivated by the idea to replace the Moore-Penrose pseudoinverse by a sparser generalized inverse which is in some sense well-behaved. Sparsity me...

متن کامل

The reverse order law for Moore-Penrose inverses of operators on Hilbert C*-modules

Suppose $T$ and $S$ are Moore-Penrose invertible operators betweenHilbert C*-module. Some necessary and sufficient conditions are given for thereverse order law $(TS)^{ dag} =S^{ dag} T^{ dag}$ to hold.In particular, we show that the equality holds if and only if $Ran(T^{*}TS) subseteq Ran(S)$ and $Ran(SS^{*}T^{*}) subseteq Ran(T^{*}),$ which was studied first by Greville [{it SIAM Rev. 8 (1966...

متن کامل

A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra

This work deals with the communication complexity of secure multi-party protocols for linear algebra problems. In our model, complexity is measured in terms of the number of secure multiplications required and protocols terminate within a constant number of rounds of

متن کامل

On Nonnegative Moore-Penrose Inverses of Perturbed Matrices

We consider the problem of characterizing nonnegativity of the Moore-Penrose inverse for matrix perturbations of the type A − XGY, when the Moore-Penrose inverse of A is nonnegative. Here, we say that a matrix B = (b ij ) is nonnegative and denote it by B ≥ 0 if b ij ≥ 0, ∀i, j. This problemwasmotivated by the results in [1], where the authors consider an M-matrix A and find sufficient conditio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2019

ISSN: 1024-123X,1563-5147

DOI: 10.1155/2019/5060397